Reasoning About Typicality in Preferential Description Logics: Preferential vs Rational Entailment
نویسندگان
چکیده
Extensions of Description Logics (DLs) to reason about typicality and defeasible inheritance have been largely investigated. In this paper, we consider two such extensions, namely (i) the extension of DLs with a typicality operator T, having the properties of Preferential nonmonotonic entailment P, and (ii) its variant with a typicality operator having the properties of the stronger Rational entailment R. The first one has been proposed in [1, 2]. Here, we investigate the second one and we show, by a representation theorem, that it is equivalent to the approach to preferential subsumption proposed in [3]. We compare the two extensions, preferential and rational, and argue that the first one is more suitable than the second one to reason about typicality, as the latter leads to unintuitive inferences.
منابع مشابه
Preferential vs Rational Description Logics: which one for Reasoning About Typicality?
Extensions of Description Logics (DLs) to reason about typicality and defeasible inheritance have been largely investigated. In this paper, we consider two such extensions, namely (i) the extension of DLs with a typicality operator T, having the properties of Preferential nonmonotonic entailment P, and (ii) its variant with a typicality operator having the properties of the stronger Rational en...
متن کاملPreferential Low Complexity Description Logics: Complexity Results and Proof Methods
In this paper we describe an approach for reasoning about typicality and defeasible properties in low complexity preferential Description Logics. We describe the non-monotonic extension of the low complexity DLs EL and DL-Litecore based on a typicality operator T, which enjoys a preferential semantics. We summarize complexity results for such extensions, called EL⊥Tmin and DL-LitecTmin. Entailm...
متن کاملReasoning in Description Logics with Typicalities and Probabilities of Exceptions
We introduce a nonmonotonic procedure for preferential Description Logics in order to reason about typicality by taking probabilities of exceptions into account. We consider an extension, calledALC+TR, of the logic of typicality ALC +TR by inclusions of the form T(C) vp D, whose intuitive meaning is that “typical Cs are Ds with a probability p”. We consider a notion of extension of an ABox cont...
متن کاملALC + Texp: Beyond most likely Scenarios in Preferential Description Logics of Typicality
In this work we continue our investigation about the opportunity of reasoning about alternative, surprising scenarios in preferential Description Logics of typicality. We extend the results provided in [1] and presented at CILC 2015, where a nonmonotonic procedure for preferential Description Logics has been outlined in order to solve a problem coming from sports entertainment. Here we provide ...
متن کاملRAT-OWL: Reasoning with Rational Closure in Description Logics of Typicality
We present RAT-OWL, a software system for reasoning about typicality in preferential Description Logics. It is implemented in the form of a Protégé 4.3 Plugin and it allows the user to reason in a nonmonotonic extension of Description Logics based on the notion of “rational closure”. This logic extends standard Description Logics in order to express “typical” properties, that can be directly sp...
متن کامل